The Conjugate Formal Product of a Graph
نویسنده
چکیده
Let G be a simple graph of order n and let V (G) be its vertex set. Let c = a + b √ m and c = a − b√m, where a and b are two nonzero integers and m is a positive integer such that m is not a perfect square. We say that A = [cij ] is the conjugate adjacency matrix of the graph G if cij = c for any two adjacent vertices i and j, cij = c for any two nonadjacent vertices i and j, and cij = 0 if i = j. Let P c G(λ) = |λI − A| denote the conjugate characteristic polynomial of G and let [Acij] = {λI−A}, where {M} denotes the adjoint matrix of a square matrix M . For any two subsets X,Y ⊆ V (G) define 〈X,Y 〉 = ∑
منابع مشابه
More inequalities for Laplacian indices by way of majorization
The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG...
متن کاملThe Merrifield-Simmons indices and Hosoya indices of some classes of cartesian graph product
The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملApplications of Fuzzy Program Graph in Symbolic Checking of Fuzzy Flip-Flops
All practical digital circuits are usually a mixture of combinational and sequential logic. Flip–flops are essential to sequential logic therefore fuzzy flip–flops are considered to be among the most essential topics of fuzzy digital circuit. The concept of fuzzy digital circuit is among the most interesting applications of fuzzy sets and logic due to the fact that if there has to be an ultimat...
متن کاملGraph product of generalized Cayley graphs over polygroups
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
متن کامل